A trust region method based on interior point techniques for nonlinear programming

An algorithm for minimizing a nonlinear function subject to nonlinear inequality constraints is described It applies sequential quadratic programming techniques to a sequence of barrier problems and uses trust regions to ensure the robustness of the iteration and to allow the direct use of second order derivatives This framework permits primal and primal dual steps but the paper focuses on the primal version of the new algorithm An analysis of the convergence properties of this method is presented